Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains
نویسنده
چکیده
The resourcefulness of people working in the area of cryptology is striking. A wonderfully diverse set of professionals capable of generating an almost endless stream of new, intriguing research problems and, fortunately—driven by the ever faster changing playing field of our information society and infrastructure under attack—capable of finding many ingenious and compelling solutions as well. Unsurprisingly, mathematics plays a central role in cryptology along with computer science. The algorithmic problem chosen as the topic of this paper has a unique motivation in cryptography. At the core of its solution lies an intricate fractal structure which turns out to have a very nice and simple characterization.
منابع مشابه
Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal
We present explicit optimal binary pebbling algorithms for reversing one-way hash chains. For a hash chain of length 2, the number of hashes performed in each output round does not exceed d k 2 e, whereas the number of hash values stored throughout is at most k. This is optimal for binary pebbling algorithms characterized by the property that the midpoint of the hash chain is computed just once...
متن کاملFractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a rooted, balanced dary tree of height h, whose internal nodes are labelled with d-ary functions on [k] = {1, . . . , k}, and whose leaves are labelled with elements of [k]. Each node obtains a value in [k] equal to its d-ary...
متن کاملEfficient Pebbling for List Traversal Synopses
We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in forward steps. Using O(lg n) memory for a list of size n, the i’th back-step from the farthest point reached so far takes O(lg i) time in the worst case, while the overhead per forward step is at most ǫ for arbitrary small constant ǫ > 0. An arbitrary sequence of forw...
متن کاملPebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separating L and LogDCFL. The input to the problem is a rooted, balanced binary tree of height h, whose internal nodes are labeled with binary functions on [k] = {1, . . . , k} (each given simply as a list of k2 elements of ...
متن کاملOn the Computational Complexity of Minimal Cumulative Cost Graph Pebbling
We consider the computational complexity of finding a legal black pebbling of a DAG G = (V, E) with minimum cumulative cost. A black pebbling is a sequence P0, . . . , Pt ⊆ V of sets of nodes which must satisfy the following properties: P0 = ∅ (we start off with no pebbles on G), sinks(G) ⊆ ⋃j≤t Pj (every sink node was pebbled at some point) and parents ( Pi+1\Pi ) ⊆ Pi (we can only place a new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.03748 شماره
صفحات -
تاریخ انتشار 2018